Routing Technicians under Stochastic Service Times: A Robust Optimization Approach

نویسندگان

  • Cristián E. Cortés
  • Fernando Ordóñez
  • Sebastián Souyris
  • Andrés Weintraub
چکیده

In this research, the objective is to solve the problem of routing repair technicians to service equipment distributed in client locations. Provided a list of requests for service, we can assign any one of K technicians to service them. Each request for service includes a deadline to begin the service Wi, and an estimated service time si, decided from the diagnosis of the problem at the time of the request. This problem is inspired by a real industrial application, in which about 40 to 50 requests have to be attended by 10 technicians, every day. This problem is naturally formulated as a classic Vehicle Routing Problem with Soft Time Windows (VRPTW).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A robust optimization approach to dispatching technicians under stochastic service times

We consider the problem of dispatching technicians to service/repair geographically distributed equipment. This problem can be cast as a vehicle routing problem with time windows, where customers expect fast response and small delays. Estimates of the service time, however, can be subject to a significant amount of uncertainty due to misdiagnosis of the reason for failure or surprises during re...

متن کامل

A Combined Stochastic Programming and Robust Optimization Approach for Location-Routing Problem and Solving it via Variable Neighborhood Search algorithm

The location-routing problem is one of the combined problems in the area of supply chain management that simultaneously make decisions related to location of depots and routing of the vehicles. In this paper, the single-depot capacitated location-routing problem under uncertainty is presented. The problem aims to find the optimal location of a single depot and the routing of vehicles to serve th...

متن کامل

A Model and Algorithm for the Courier Delivery Problem with Uncertainty

We consider the Courier Delivery Problem, a variant of the Vehicle Routing Problem with time windows in which customers appear probabilistically and their service times are uncertain. We use scenario-based stochastic programming with recourse to model the uncertainty in customers and robust optimization for the uncertainty in service times. Our proposed model generates a master plan and daily s...

متن کامل

Demand-oriented timetable design for urban rail transit under stochastic demand

In the context of public transportation system, improving the service quality and robustness through minimizing the average passengers waiting time is a real challenge. This study provides robust stochastic programming models for train timetabling problem in urban rail transit systems. The objective is minimization of the weighted summation of the expected cost of passenger waiting time, its va...

متن کامل

A Robust Model for a Dynamic Cellular Manufacturing System with Production Planning

In this paper, a robust optimization approach is proposed to design a dynamic cellular manufacturing system (DCMS) under uncertainty of processing time of products. In addition, a mathematical model considering cell formation, inter-cell design and production planning under a dynamic environment (i.e., product mix and demand are changed in each period) is presented. Therefore, reconfiguration b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007